MMIC technology for advanced space communications systems

The current NASA program for 20 and 30 GHz monolithic microwave integrated circuit (MMIC) technology is reviewed. The advantages of MMIC are discussed. Millimeter wavelength MMIC applications and technology for communications systems are discussed. Passive and active MMIC compatible components for millimeter wavelength applications are investigated. The cost of a millimeter wavelength MMIC's is projected

The Parameterized Complexity of Domination-type Problems and Application to Linear Codes

We study the parameterized complexity of domination-type problems. (sigma,rho)-domination is a general and unifying framework introduced by Telle: a set D of vertices of a graph G is (sigma,rho)-dominating if for any v in D, |N(v)\cap D| in sigma and for any $v\notin D, |N(v)\cap D| in rho. We mainly show that for any sigma and rho the problem of (sigma,rho)-domination is W[2] when parameterized by the size of the dominating set. This general statement is optimal in the sense that several particular instances of (sigma,rho)-domination are W[2]-complete (e.g. Dominating Set). We also prove that (sigma,rho)-domination is W[2] for the dual parameterization, i.e. when parameterized by the size of the dominated set. We extend this result to a class of domination-type problems which do not fall into the (sigma,rho)-domination framework, including Connected Dominating Set. We also consider problems of coding theory which are related to domination-type problems with parity constraints. In particular, we prove that the problem of the minimal distance of a linear code over Fq is W[2] for both standard and dual parameterizations, and W[1]-hard for the dual parameterization. To prove W[2]-membership of the domination-type problems we extend the Turing-way to parameterized complexity by introducing a new kind of non deterministic Turing machine with the ability to perform `blind' transitions, i.e. transitions which do not depend on the content of the tapes. We prove that the corresponding problem Short Blind Multi-Tape Non-Deterministic Turing Machine is W[2]-complete. We believe that this new machine can be used to prove W[2]-membership of other problems, not necessarily related to dominationComment: 19 pages, 2 figure

Genetically Engineered T-Cells for Malignant Glioma: Overcoming the Barriers to Effective Immunotherapy.

Malignant gliomas carry a dismal prognosis. Conventional treatment using chemo- and radiotherapy has limited efficacy with adverse events. Therapy with genetically engineered T-cells, such as chimeric antigen receptor (CAR) T-cells, may represent a promising approach to improve patient outcomes owing to their potential ability to attack highly infiltrative tumors in a tumor-specific manner and possible persistence of the adaptive immune response. However, the unique anatomical features of the brain and susceptibility of this organ to irreversible tissue damage have made immunotherapy especially challenging in the setting of glioma. With safety concerns in mind, multiple teams have initiated clinical trials using CAR T-cells in glioma patients. The valuable lessons learnt from those trials highlight critical areas for further improvement: tackling the issues of the antigen presentation and T-cell homing in the brain, immunosuppression in the glioma microenvironment, antigen heterogeneity and off-tumor toxicity, and the adaptation of existing clinical therapies to reflect the intricacies of immune response in the brain. This review summarizes the up-to-date clinical outcomes of CAR T-cell clinical trials in glioma patients and examines the most pressing hurdles limiting the efficacy of these therapies. Furthermore, this review uses these hurdles as a framework upon which to evaluate cutting-edge pre-clinical strategies aiming to overcome those barriers

Microwave monolithic integrated circuit development for future spaceborne phased array antennas

The development of fully monolithic gallium arsenide (GaAs) receive and transmit modules suitable for phased array antenna applications in the 30/20 gigahertz bands is presented. Specifications and various design approaches to achieve the design goals are described. Initial design and performance of submodules and associated active and passive components are presented. A tradeoff study summary is presented highlighting the advantages of distributed amplifier approach compared to the conventional single power source designs

The Complexity of Routing with Few Collisions

We study the computational complexity of routing multiple objects through a network in such a way that only few collisions occur: Given a graph $G$ with two distinct terminal vertices and two positive integers $p$ and $k$, the question is whether one can connect the terminals by at least $p$ routes (e.g. paths) such that at most $k$ edges are time-wise shared among them. We study three types of routes: traverse each vertex at most once (paths), each edge at most once (trails), or no such restrictions (walks). We prove that for paths and trails the problem is NP-complete on undirected and directed graphs even if $k$ is constant or the maximum vertex degree in the input graph is constant. For walks, however, it is solvable in polynomial time on undirected graphs for arbitrary $k$ and on directed graphs if $k$ is constant. We additionally study for all route types a variant of the problem where the maximum length of a route is restricted by some given upper bound. We prove that this length-restricted variant has the same complexity classification with respect to paths and trails, but for walks it becomes NP-complete on undirected graphs

The Hardness of Embedding Grids and Walls

The dichotomy conjecture for the parameterized embedding problem states that the problem of deciding whether a given graph $G$ from some class $K$ of "pattern graphs" can be embedded into a given graph $H$ (that is, is isomorphic to a subgraph of $H$) is fixed-parameter tractable if $K$ is a class of graphs of bounded tree width and $W[1]$-complete otherwise. Towards this conjecture, we prove that the embedding problem is $W[1]$-complete if $K$ is the class of all grids or the class of all walls

Eating Is Not Political Action

Food and environment are cultural stalwarts. Picture the red barn and solitary farmer toiling over fruited plains; or purple mountains majesty reflected in pristine waters. Agriculture and environment are core, distinct, American mythologies that we know are more intertwined than our stories reveal. To create policy at the interface of such centrally important and overlapping American ideals, there are two options. Passive governance fosters markets in which participants make individual choices that aggregate into inadvertent collective action. In contrast, assertive governance allows the public, mediated through elected officials, to enact intentional, goal oriented policy. American mythologies of food and environment arise because each is important culturally and physically. Given their essentiality, we must demand more intentionality, must demand policies not only because they are possible, but because they are thoughtful, effective, goal oriented, and intentional. Food and the environment are both too important to do otherwise. In today’s political climate, finding shared goals will be hard and accidental policy may be the best we can hope for in the short term. Progressive food advocates may settle for passive policies because these policies make fewer normative commitments. For three decades this has been exactly the strategy of environmental advocates. It is the wrong strategy. Without boldly speaking about our goals, even when we know we will fall short, we cannot imagine the big picture that we intend to paint, the new integrated mythology we intend to write

Seven exercises planned to stimulate the flow of ideas in creative composition

Thesis (Ed.M.)--Boston Universit

Multidimensional Binary Vector Assignment problem: standard, structural and above guarantee parameterizations

In this article we focus on the parameterized complexity of the Multidimensional Binary Vector Assignment problem (called \BVA). An input of this problem is defined by $m$ disjoint sets $V^1, V^2, \dots, V^m$, each composed of $n$ binary vectors of size $p$. An output is a set of $n$ disjoint $m$-tuples of vectors, where each $m$-tuple is obtained by picking one vector from each set $V^i$. To each $m$-tuple we associate a $p$ dimensional vector by applying the bit-wise AND operation on the $m$ vectors of the tuple. The objective is to minimize the total number of zeros in these $n$ vectors. mBVA can be seen as a variant of multidimensional matching where hyperedges are implicitly locally encoded via labels attached to vertices, but was originally introduced in the context of integrated circuit manufacturing. We provide for this problem FPT algorithms and negative results ($ETH$-based results, $W$[2]-hardness and a kernel lower bound) according to several parameters: the standard parameter $k$ i.e. the total number of zeros), as well as two parameters above some guaranteed values.Comment: 16 pages, 6 figure